Faster Algorithms for Finding Minimal Consistent DFAs
نویسنده
چکیده
We describe exbar, a powerful new algorithm for the exact inference of minimal deterministic automata from given training data. This algorithm achieves the highest performance ever on a set of graded benchmark problems that has been posted by Arlindo Oliveira. In addition, we note that the inexact program ed-beam, which resulted from the Abbadingo DFA learning competition, also does well on this benchmark set, despite being designed for larger problems.
منابع مشابه
The DFAs of Finitely Different Languages
Two languages are finitely different if their symmetric difference is finite. We consider the DFAs of finitely different regular languages and find major structural similarities. We proceed to consider the smallest DFAs that recognize a language finitely different from some given DFA. Such f-minimal DFAs are not unique, and this non-uniqueness is characterized. Finally, we offer a solution to t...
متن کاملOpen Problem: Meeting Times for Learning Random Automata
Learning automata is a foundational problem in computational learning theory. However, even efficiently learning random DFAs is hard. A natural restriction of this problem is to consider learning random DFAs under the uniform distribution. To date, this problem has no non-trivial lower bounds nor algorithms faster than brute force. In this note, we propose a method to find faster algorithms for...
متن کاملActive Coevolutionary Learning of Deterministic Finite Automata
This paper describes an active learning approach to the problem of grammatical inference, specifically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the estimation-exploration algorithm (EEA). This approach differs from previous passive and active learning approaches to grammatical inference in that training data is actively proposed by the algorithm, rathe...
متن کاملMinimization of Acyclic DFAs
There exists a linear time algorithm for the minimization of acyclic deterministic finite-state automata (ADFA) due to Dominique Revuz [17]. The algorithm has different phases involving the computation of a height for each state, sorting states of the same height and joining equivalent states. We present a new linear time algorithm for the task at hand. The algorithm is conceptionally simpler a...
متن کاملRandom DFAs over a Non-Unary Alphabet
This document gives a generalization on the alphabet size of the method that is described in Nicaud’s thesis for randomly generating complete DFAs. First we recall some properties of m-ary trees and we give a bijection between the set of m-ary trees and the set (m,n) of generalized n-tuples. We show that this bijection can be built on any prefix total order on Σ. Then we give the relations that...
متن کامل